Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machinery --- Mechanical engineering --- Machine theory --- Machines --- Génie mécanique --- Périodiques. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material

Machine theory. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines. Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems. Presents the concepts of Automata Theory and Formal Languages in an easy-to-understand approach Helps the readers understand key concepts by solving real-world examples. Provides the readers with a simple approach to connect the theory with the latest trend like software testing, cybersecurity, artificial intelligence, and machine learning. Includes a wide coverage of applications of automata theory and formal languages.

Machine theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formal languages. --- Formalization (Linguistics) --- Language and languages --- Machine theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic.Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger.Serves as both an introduction to the field and as a reference

Machine theory. --- Group theory. --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Mathematical Sciences --- Applied Mathematics --- Group theory --- Machine theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Electronic data processing --- Machine theory --- Information storage and retrieval systems --- Periodicals --- Informatique --- Automates mathématiques, Théorie des --- Systèmes d'information --- Périodiques. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics